Practical Non-Interactive Key Distribution Based on Pairings
نویسندگان
چکیده
منابع مشابه
A Killer Application for Pairings: Authenticated Key Establishment in Underwater Wireless Sensor Networks
Wireless sensors are low power devices which are highly constrained in terms of computational capabilities, memory, and communication bandwidth. While battery life is their main limitation, they require considerable energy to communicate data. The latter is specially dramatic in underwater wireless sensor networks (UWSN), where the acoustic transmission mechanisms are less reliable and more ene...
متن کاملGroth-Sahai Proofs Revisited
Since their introduction in 2008, the non-interactive zeroknowledge (NIZK) and non-interactive witness indistinguishable (NIWI) proofs designed by Groth and Sahai have been used in numerous applications. In this paper, we offer two contributions to the study of these proof systems. First, we identify and correct some errors, present in the oringal online manuscript, that occur in two of the thr...
متن کاملThe Exact Security of Pairing Based Encryption and Signature Schemes
Bilinear pairings have been intensively used in the design of cryptographic protocols during the last few years. For instance, short signatures and non-interactive key exchange protocols have been designed with them, and they appear as a key component for identity-based cryptography. Focusing on encryption and signature schemes built on bilinear pairings, we look at the security reductions of s...
متن کاملAdditive Proofs of Knowledge - A New Notion for Non-Interactive Proofs
This paper has two contributions. Firstly, we describe an efficient Non-Interactive Zero-Knowledge (NIZK) Proof of Knowledge (PoK) protocol using bilinear pairings. The protocol assumes the hardness of the Computational Diffie-Hellman (CDH) problem. The prover does not perform any pairing computations while the verifier performs 3 pairing computations. The protocol can be used for identificatio...
متن کاملTightly CCA-Secure Encryption Without Pairings
We present the first CCA-secure public-key encryption scheme based on DDH where the security loss is independent of the number of challenge ciphertexts and the number of decryption queries. Our construction extends also to the standard k-Lin assumption in pairing-free groups, whereas all prior constructions starting with Hofheinz and Jager (Crypto ’12) rely on the use of pairings. Moreover, our...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2002 شماره
صفحات -
تاریخ انتشار 2002